Fitting Directed Acyclic Graphs with latent nodes as finite mixtures models, with application to education transmission

نویسنده

  • Antonio Forcina
چکیده

This paper describes an efficient EM algorithm for maximum likelihood estimation of a system of non linear structural equations corresponding to a directed acyclic graph model; this can contain an arbitrary number of latent variables, as long as the model is identifiable. The only limitation is that the endogenous variables in the model must be discrete, with qualitative or ordered categories, while the exogenous variables may be arbitrary. The models described in this paper are defined by the list of structural equations and, for each equation, the type of link function and the linear model to be used. These models are an extended version of finite mixture models which may be suitable for causal inference when several sources of latent heterogeneity may be present. An application to the problem of education transmission, where one would like to control for the ability of the parents and that of the child, is presented as an illustration.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Maximum likelihood fitting of acyclic directed mixed graphs to binary data

Acyclic directed mixed graphs, also known as semi-Markov models represent the conditional independence structure induced on an observed margin by a DAG model with latent variables. In this paper we present the first method for fitting these models to binary data using maximum likelihood estimation.

متن کامل

A New Inferential Test for Path Models Based on Directed Acyclic Graphs

This article introduces a new inferential test for acyclic structural equation models (SEM) without latent variables or correlated errors. The test is based on the independence relations predicted by the directed acyclic graph of the SEMs, as given by the concept of d-separation. A wide range of distributional assumptions and structural functions can be accommodated. No iterative fitting proced...

متن کامل

A factorization criterion for acyclic directed mixed graphs

Acyclic directed mixed graphs, also known as semi-Markov models represent the conditional independence structure induced on an observed margin by a DAG model with latent variables. In this paper we present a factorization criterion for these models that is equivalent to the global Markov property given by (the natural extension of) dseparation.

متن کامل

Directed cyclic graphs, conditional independence, and non-recursive linear structural equation models

Recursive linear structural equation models can be represented by directed acyclic graphs. When represented in this way, they satisfy the Markov Condition. Hence it is possible to use the graphical d-separation to determine what conditional independence relations are entailed by a given linear structural equation model. I prove in this paper that it is also possible to use the graphical d-separ...

متن کامل

Graphical Markov Models with Mixed Graphs in R

In this paper we provide a short tutorial illustrating the new functions in the package ggm that deal with ancestral, summary and ribbonless graphs. These are mixed graphs (containing three types of edges) that are important because they capture the modified independence structure after marginalisation over, and conditioning on, nodes of directed acyclic graphs. We provide functions to verify w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015